Itemset frequency satisfiability: Complexity and axiomatization

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Itemset frequency satisfiability: Complexity and axiomatization

Computing frequent itemsets is one of the most prominent problems in data min-ing. We study the following related problem, called FREQSAT, in depth: given someitemset-interval pairs, does there exist a database such that for every pair the fre-quency of the itemset falls into the interval? This problem is shown to be NP-complete. The problem is then further extended to inclu...

متن کامل

Graded Modal Logic GS5 and Itemset Support Satisfiability

Graded modal logic GS5 is an extension of S5 by the modal connective } : the formula } A means that there are at least worlds satisfying A. In this paper, we show how to reduce GS5 satisfiability to propositional satisfiability (SAT). Furthermore, we consider a satisfiability problem related to the frequent itemset mining problem: SUPPSAT (where n is a strictly positive integer). We show how SU...

متن کامل

Complexity of the Satisfiability Problem

These notes contain, among others, a proof that the average running time of an easy solution to the satisfiability problem for propositional calculus is, under some reasonable assumptions, linear (with constant 2) in the size of the input. Moreover, some suggestions are made about criteria for tractability of complex algorithms. In particular, it is argued that the distribution of probability o...

متن کامل

Satisfiability in Nonlinear Time: Algorithms and Complexity

Most work on temporal interval relations and associated automated reasoning methods assumes linear (totally ordered) time. Although checking the consistency of temporal interval constraint networks is known to be NP-hard in general, many tractable subclasses of linear-time temporal relations are known for which a standard O(ns) constraint propagation algorithm actually determines the global con...

متن کامل

The Logic of "Initially" and "Next": Complete Axiomatization and Complexity

In 3], a large number of completeness results about variants of discrete linear-time temporal logic are obtained. One of them is left as an open problem: the completeness of the logic of initially and next, for which a deductive system is proposed. This simple logic is of practical importance, since the proof of program invariants only require these modalities. We show here that the conjectured...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2008

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2007.11.003